Efficient Incremental Plan Recognition Method for Cognitive Assistance
Identifieur interne : 001324 ( Main/Exploration ); précédent : 001323; suivant : 001325Efficient Incremental Plan Recognition Method for Cognitive Assistance
Auteurs : Hamdi Aloulou ; Mohamed Ali Feki [Singapour] ; Clifton Phua [Singapour] ; Jit Biswas [Singapour]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
Abstract
Abstract: In this paper we propose an efficient and incremental plan recognition method for cognitive assistance. We design our unique method based on graph matching and heuristic chaining rules in order to deal with interleaved and sequential activities. The finding of this research work is to be applied to predict abnormal behavior of the users, and optimize assistance for them. We have studied a use case of kitchen environment during lunch time that we will discuss in this paper and targeted Dementia patients. We will present implementation details as well as our evaluation plan.
Url:
DOI: 10.1007/978-3-642-02868-7_28
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003498
- to stream Istex, to step Curation: 003498
- to stream Istex, to step Checkpoint: 000A74
- to stream Main, to step Merge: 001328
- to stream Main, to step Curation: 001324
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient Incremental Plan Recognition Method for Cognitive Assistance</title><author><name sortKey="Aloulou, Hamdi" sort="Aloulou, Hamdi" uniqKey="Aloulou H" first="Hamdi" last="Aloulou">Hamdi Aloulou</name></author><author><name sortKey="Feki, Mohamed Ali" sort="Feki, Mohamed Ali" uniqKey="Feki M" first="Mohamed Ali" last="Feki">Mohamed Ali Feki</name></author><author><name sortKey="Phua, Clifton" sort="Phua, Clifton" uniqKey="Phua C" first="Clifton" last="Phua">Clifton Phua</name></author><author><name sortKey="Biswas, Jit" sort="Biswas, Jit" uniqKey="Biswas J" first="Jit" last="Biswas">Jit Biswas</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B71AD6B0BF6751F26CD62056AFF300B5B56FABCC</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-02868-7_28</idno><idno type="url">https://api.istex.fr/document/B71AD6B0BF6751F26CD62056AFF300B5B56FABCC/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">003498</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003498</idno><idno type="wicri:Area/Istex/Curation">003498</idno><idno type="wicri:Area/Istex/Checkpoint">000A74</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000A74</idno><idno type="wicri:doubleKey">0302-9743:2009:Aloulou H:efficient:incremental:plan</idno><idno type="wicri:Area/Main/Merge">001328</idno><idno type="wicri:Area/Main/Curation">001324</idno><idno type="wicri:Area/Main/Exploration">001324</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Efficient Incremental Plan Recognition Method for Cognitive Assistance</title><author><name sortKey="Aloulou, Hamdi" sort="Aloulou, Hamdi" uniqKey="Aloulou H" first="Hamdi" last="Aloulou">Hamdi Aloulou</name><affiliation><wicri:noCountry code="no comma">Ecole Nationale d’Ingenieure de Sfax</wicri:noCountry></affiliation></author><author><name sortKey="Feki, Mohamed Ali" sort="Feki, Mohamed Ali" uniqKey="Feki M" first="Mohamed Ali" last="Feki">Mohamed Ali Feki</name><affiliation wicri:level="1"><country xml:lang="fr">Singapour</country><wicri:regionArea>Networking Protocols Department, Institute for Infocomm Research</wicri:regionArea><wicri:noRegion>Institute for Infocomm Research</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Singapour</country></affiliation></author><author><name sortKey="Phua, Clifton" sort="Phua, Clifton" uniqKey="Phua C" first="Clifton" last="Phua">Clifton Phua</name><affiliation wicri:level="1"><country xml:lang="fr">Singapour</country><wicri:regionArea>Data Mining Department, Institute for Infocomm Research</wicri:regionArea><wicri:noRegion>Institute for Infocomm Research</wicri:noRegion></affiliation></author><author><name sortKey="Biswas, Jit" sort="Biswas, Jit" uniqKey="Biswas J" first="Jit" last="Biswas">Jit Biswas</name><affiliation wicri:level="1"><country xml:lang="fr">Singapour</country><wicri:regionArea>Networking Protocols Department, Institute for Infocomm Research</wicri:regionArea><wicri:noRegion>Institute for Infocomm Research</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">B71AD6B0BF6751F26CD62056AFF300B5B56FABCC</idno><idno type="DOI">10.1007/978-3-642-02868-7_28</idno><idno type="ChapterID">28</idno><idno type="ChapterID">Chap28</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper we propose an efficient and incremental plan recognition method for cognitive assistance. We design our unique method based on graph matching and heuristic chaining rules in order to deal with interleaved and sequential activities. The finding of this research work is to be applied to predict abnormal behavior of the users, and optimize assistance for them. We have studied a use case of kitchen environment during lunch time that we will discuss in this paper and targeted Dementia patients. We will present implementation details as well as our evaluation plan.</div></front></TEI><affiliations><list><country><li>Singapour</li></country></list><tree><noCountry><name sortKey="Aloulou, Hamdi" sort="Aloulou, Hamdi" uniqKey="Aloulou H" first="Hamdi" last="Aloulou">Hamdi Aloulou</name></noCountry><country name="Singapour"><noRegion><name sortKey="Feki, Mohamed Ali" sort="Feki, Mohamed Ali" uniqKey="Feki M" first="Mohamed Ali" last="Feki">Mohamed Ali Feki</name></noRegion><name sortKey="Biswas, Jit" sort="Biswas, Jit" uniqKey="Biswas J" first="Jit" last="Biswas">Jit Biswas</name><name sortKey="Feki, Mohamed Ali" sort="Feki, Mohamed Ali" uniqKey="Feki M" first="Mohamed Ali" last="Feki">Mohamed Ali Feki</name><name sortKey="Phua, Clifton" sort="Phua, Clifton" uniqKey="Phua C" first="Clifton" last="Phua">Clifton Phua</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001324 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001324 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:B71AD6B0BF6751F26CD62056AFF300B5B56FABCC
|texte= Efficient Incremental Plan Recognition Method for Cognitive Assistance
}}
| This area was generated with Dilib version V0.6.31. |  |